The ∆2 Turing Degrees: Automorphisms and Definability
نویسندگان
چکیده
We prove that the ∆2 Turing degrees have a finite automorphism base. We apply this result to show that the automorphism group of DT (≤ 0′) is countable and that all its members have arithmetic presentations. We prove that every relation on DT (≤ 0′) induced by an arithmetically definable degree invariant relation is definable with finitely many ∆2 parameters and show that rigidity for DT (≤ 0′) is equivalent to its biinterpretability with first order arithmetic.
منابع مشابه
Definability, automorphisms, and dynamic properties of computably enumerable sets
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their definability properties (as sets in the spirit of Cantor), their automorphisms (in the spirit of FelixKlein’sErlanger Programm), their dynamic properties, expressed in terms of how quickly elements enter them relative to elements entering other sets, and theMartin Invariance Conjecture on their Tur...
متن کاملThe ∆ 02 Turing degrees : Automorphisms and Definability
We prove that the ∆2 Turing degrees have a finite automorphism base. We apply this result to show that the automorphism group of DT (≤ 0′) is countable and that all its members have arithmetic presentations. We prove that every relation on DT (≤ 0′) induced by an arithmetically definable degree invariant relation is definable with finitely many ∆2 parameters and show that rigidity for DT (≤ 0′)...
متن کاملDiscontinuous Phenomena and Turing Definability
We discuss the relationship between discontinuity and definability in the Turing degrees, with particular reference to degree invariant solutions to Post’s Problem. Proofs of new results concerning definability in lower cones are outlined.
متن کاملTuring Definability in the Ershov Hierarchy
We obtain the first nontrivial d.c.e. Turing approximation to the class of computably enumerable (c.e.) degrees. This depends on the following extension of the splitting theorem for the d.c.e. degrees: For any d.c.e. degree a, any c.e. degree b, if b < a, then there are d.c.e. degrees x0,x1 such that b < x0,x1 < a and a = x0 ∨ x1. The construction is unusual in that it is incompatible with uppe...
متن کاملDegree Structures
The Turing degrees 3d were introduced by Kleene and Post ([9], 1954) to isolate and study those properties of the subsets of the natural numbers N which are expressed purely in terms of relative computability. Intuitively, we form 3d by identifying any pair of subsets of N which are mutually computable and ordering the resulting equivalence classes by relative computability. The natural hierarc...
متن کامل